Smooth ascent

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recursive Ascent-Descent Parsing

Generalized left-corner parsing was originally presented as a technique for generating a parser for the SLR(1) class of grammars but with far fewer states than the SLR(1) parser. This paper modi es and extends the formulation of left-corner parsers so that it is possible to apply the technique to the LALR(1) and LR(1) classes of grammars. It is further shown that left-corner parsers can be conv...

متن کامل

CPS Recursive Ascent Parsing

The parsing problem is ubiquitous in Computer Science. Perhaps that is part of the reason it has been used so frequently to illustrate the power of continuations and monads. It is often the case, though, that the parser examples of continuation passing style and monads are top-down parsers. I intend to show that the continuation passing style of programming naturally leads to bottom-up or recur...

متن کامل

Steepest Ascent Tariff Reforms

This paper introduces the concept of a steepest ascent tariff reform for a small open economy. By construction, it is locally optimal in that it yields the highest gain in utility of any feasible tariff reform vector of the same length. Accordingly, it provides a convenient benchmark for the evaluation of the welfare effectiveness of other tariff reform proposals. We develop the properties of t...

متن کامل

The gentlest ascent dynamics

Dynamical systems that describe the escape from the basins of attraction of stable invariant sets are presented and analysed. It is shown that the stable fixed points of such dynamical systems are the index-1 saddle points. Generalizations to high index saddle points are discussed. Both gradient and non-gradient systems are considered. Preliminary results on the nature of the dynamical behaviou...

متن کامل

Gradient Ascent Critic Optimization

In this paper, we address the critic optimization problem within the context of reinforcement learning. The focus of this problem is on improving an agent’s critic, so as to increase performance over a distribution of tasks. We use ordered derivatives, in a process similar to back propagation through time, to compute the gradient of an agent’s fitness with respect to its reward function. With e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature

سال: 1997

ISSN: 0028-0836,1476-4687

DOI: 10.1038/39213